Linear Time Maximum Induced Matching Algorithm for Trees
نویسنده
چکیده
A matching in a graph G is a collection of non-intersecting edges. The matching is induced if no two edges in the matching are joined by an edge in G. This paper studies the complexity of nding a largest induced matching when the input graph is a tree. We describe the rst linear time algorithm for this problem.
منابع مشابه
Maximum Induced Matching on Regular Graphs and Trees
We investigate the complexity of the Maximum Induced Matching problem on regular graphs and trees. The problem is shown to be NP-complete on regular graphs of degree 4s for any positive integer s. We also looks at very simple approximation algorithms: we show that the largest induced matching in a regular graph of degree d can be approximated with a performance ratio less than d. However a simp...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملLinear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees (Extended Version)
Abstract. The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It firs...
متن کاملLinear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees
The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It first computes...
متن کاملA Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays
Approximate string matching is an essential problem in many areas related to Computer Science including biological sequence processing. The standard solution of this problem is an O(mn) running time and space dynamic programming algorithm for two strings of length m and n. Landau and Vishkin developed an algorithm which uses suffix trees for accelerating the computation along the dynamic progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nord. J. Comput.
دوره 7 شماره
صفحات -
تاریخ انتشار 2000